Density Estimation Through Convex Combinations of Densities: Approximation and Estimation Bounds
نویسندگان
چکیده
منابع مشابه
Density Estimation Through Convex Combinations of Densities: Approximation and Estimation Bounds
We consider the problem of estimating a density function from a sequence identically distributed observations x(i) taking value in X subset R(d). The estimation procedure constructs a convex mixture of "basis" densities and estimates the parameters using the maximum likelihood method. Viewing the error as a combination of two terms, the approximation error measuring the adequacy of the model, a...
متن کاملDensity Estimation Through ConvexCombinations of Densities ; Approximation andEstimation
We consider the problem of estimating a density function from a sequence of independent and identically distributed observations x i taking value in R d. The estimation procedure constructs a convex mixture of`basis' densities and estimates the parameters using the maximum likelihood method. Viewing the error as a combination of two terms, the approximation error measuring the adequacy of the m...
متن کاملNonparametric Estimation of Multivariate Convex-transformed Densities.
We study estimation of multivariate densities p of the form p(x) = h(g(x)) for x ∈ ℝ(d) and for a fixed monotone function h and an unknown convex function g. The canonical example is h(y) = e(-y) for y ∈ ℝ; in this case, the resulting class of densities [Formula: see text]is well known as the class of log-concave densities. Other functions h allow for classes of densities with heavier tails tha...
متن کاملMotion Estimation through Approximated Densities
Many techniques are currently used for motion estimation. In the block-based approaches the most common procedure applied is the block-matching based on various algorithms. To refine the motion estimates resulting from the full search or any coarse search algorithm, one can find few applications of Kalman filtering, mainly in the intraframe scheme. The Kalman filtering technique applicability f...
متن کاملOptimal convex combinations bounds of centrodial and harmonic means for logarithmic and identric means
We find the greatest values $alpha_{1} $ and $alpha_{2} $, and the least values $beta_{1} $ and $beta_{2} $ such that the inequalities $alpha_{1} C(a,b)+(1-alpha_{1} )H(a,b)
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Neural Networks
سال: 1997
ISSN: 0893-6080
DOI: 10.1016/s0893-6080(96)00037-8